3 research outputs found
Adaptive Causal Network Coding with Feedback for Multipath Multi-hop Communications
We propose a novel multipath multi-hop adaptive and causal random linear
network coding (AC-RLNC) algorithm with forward error correction. This
algorithm generalizes our joint optimization coding solution for point-to-point
communication with delayed feedback. AC-RLNC is adaptive to the estimated
channel condition, and is causal, as the coding adjusts the retransmission
rates using a priori and posteriori algorithms. In the multipath network, to
achieve the desired throughput and delay, we propose to incorporate an adaptive
packet allocation algorithm for retransmission, across the available resources
of the paths. This approach is based on a discrete water filling algorithm,
i.e., bit-filling, but, with two desired objectives, maximize throughput and
minimize the delay. In the multipath multi-hop setting, we propose a new
decentralized balancing optimization algorithm. This balancing algorithm
minimizes the throughput degradation, caused by the variations in the channel
quality of the paths at each hop. Furthermore, to increase the efficiency, in
terms of the desired objectives, we propose a new selective recoding method at
the intermediate nodes. We derive bounds on the throughput and the mean and
maximum in order delivery delay of AC-RLNC, both in the multipath and multipath
multi-hop case. In the multipath case, we prove that in the non-asymptotic
regime, the suggested code may achieve more than 90% of the channel capacity
with zero error probability. In the multipath multi-hop case, the balancing
procedure is proven to be optimal with regards to the achieved rate. Through
simulations, we demonstrate that the performance of our adaptive and causal
approach, compared to selective repeat (SR)-ARQ protocol, is capable of gains
up to a factor two in throughput and a factor of more than three in delay
Adaptive Causal Network Coding with Feedback for Multipath Multi-hop Communications
We propose a novel multipath multi-hop adaptive and causal random linear network coding (AC-RLNC) algorithm with forward error correction. This algorithm generalizes our joint optimization coding solution for point-to-point communication with delayed feedback. AC-RLNC is adaptive to the estimated channel condition, and is causal, as the coding adjusts the retransmission rates using a priori and posteriori algorithms. In the multipath network, to achieve the desired throughput and delay, we propose to incorporate an adaptive packet allocation algorithm for retransmission, across the available resources of the paths. This approach is based on a discrete water filling algorithm, i.e., bit-filling, but, with two desired objectives, maximize throughput and minimize the delay. In the multipath multi-hop setting, we propose a new decentralized balancing optimization algorithm. This balancing algorithm minimizes the throughput degradation, caused by the variations in the channel quality of the paths at each hop. Furthermore, to increase the efficiency, in terms of the desired objectives, we propose a new selective recoding method at the intermediate nodes. Through simulations, we demonstrate that the performance of our adaptive and causal approach, compared to selective repeat (SR)-ARQ protocol, is capable of gains up to a factor two in throughput and a factor of more than three in delay
Adaptive Causal Network Coding with Feedback
© 1972-2012 IEEE. We propose a novel adaptive and causal random linear network coding (AC-RLNC) algorithm with forward error correction (FEC) for a point-to-point communication channel with delayed feedback. AC-RLNC is adaptive to the channel condition, that the algorithm estimates, and is causal, as coding depends on the particular erasure realizations, as reflected in the feedback acknowledgments. Specifically, the proposed model can learn the erasure pattern of the channel via feedback acknowledgments, and adaptively adjust its retransmission rates using a priori and posteriori algorithms. By those adjustments, AC-RLNC achieves the desired delay and throughput, and enables transmission with zero error probability. We upper bound the throughput and the mean and maximum in order delivery delay of AC-RLNC, and prove that for the point to point communication channel in the non-asymptotic regime the proposed code may achieve more than 90% of the channel capacity. To upper bound the throughput we utilize the minimum Bhattacharyya distance for the AC-RLNC code. We validate those results via simulations. We contrast the performance of AC-RLNC with the one of selective repeat (SR)-ARQ, which is causal but not adaptive, and is a posteriori. Via a study on experimentally obtained commercial traces, we demonstrate that a protocol based on AC-RLNC can, vis-à-vis SR-ARQ, double the throughput gains, and triple the gain in terms of mean in order delivery delay when the channel is bursty. Furthermore, the difference between the maximum and mean in order delivery delay is much smaller than that of SR-ARQ. Closing the delay gap along with boosting the throughput is very promising for enabling ultra-reliable low-latency communications (URLLC) applications